Propositionalizing the EM algorithm by BDDs
نویسندگان
چکیده
We propose an Expectation-Maximization (EM) algorithm which works on binary decision diagrams (BDDs). The proposed algorithm, BDD-EM algorithm, opens a way to apply BDDs to statistical learning. The BDD-EM algorithm makes it possible to learn probabilities in statistical models described by Boolean formulas, and the time complexity is proportional to the size of BDDs representing them. We apply the BDD-EM algorithm to prediction of intermittent errors in logic circuits and demonstrate that it can identify error gates in a 3bit adder circuit.
منابع مشابه
Evaluating Abductive Hypotheses using an EM Algorithm on BDDs
Abductive inference is an important AI reasoning technique to find explanations of observations, and has recently been applied to scientific discovery. To find best hypotheses among many logically possible hypotheses, we need to evaluate hypotheses obtained from the process of hypothesis generation. We propose an abductive inference architecture combined with an EM algorithm working on binary d...
متن کاملAn EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions to realize efficient probability computation and learning. We propose an EM algorithm working on BDDs with order encoding for LBPMs. A notable advantage of our algorithm over existing approaches is that it copes with ...
متن کاملOn the Complexity of Operations on Graph Driven Bdds and Tree Driven Bdds
Graph driven BDDs introduced by Sieling and Wegener (1992) and Gergov and Meinel (1993) are an extension of OBDDs that admit more concise representations of Boolean functions than OBDDs. We investigate the complexity of the operations replacement by constants and functions, quantiication, redundancy test and reordering on graph driven BDDs and on a restricted variant of graph driven BDDs called...
متن کاملSable Research Group Points - to Analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been shown very effective for representing large sets and solving very large verification problems. Our work shows that BDDs can also be very effective for developing a points-to analysis that is simple to implement and that...
متن کاملMcGill University School of Computer Science Sable Research Group Points - to Analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been shown very effective for representing large sets and solving very large verification problems. Our work shows that BDDs can also be very effective for developing a points-to analysis that is simple to implement and that...
متن کامل